Multi-Dimensional Heuristic Searching
نویسندگان
چکیده
A heuristic improvement technique referred to as multi-dimensional heuristics is presented. Instead of only applying the heuristic between two states X 1 and X 2 , when a distance esti mate of X 1 X 2 is needed, this technique uses a reference state R and applies the heuristic func tion to {X 1 ,R) and (X' 2 ,R) and compares the resulting values. If two states are close to each other, then they should also be approximately equidistant to a third reference state. It is pos sible to use many such reference states to im prove some heuristics. The reference states are used to map the search into an N-dimensional search space. The process of choosing reference states can be automated and is in fact a learn ing procedure. Test results using the 15-puzzle are presented in support of the effectiveness of multi-dimensional heuristics. This method has been shown to improve both a weak 15-puzzle heuristic, the tile reversal heuristic, as well as the stronger Manhattan distance heuristic. 1 Introduction Traditional heuristic search involves ordering state ex pansions relative to their estimated costs of participat ing in a solution. This cost is computed by a function f = g + h where g is the known cost (depth) arid h is an estimate of the remaining cost or distance to the goal [Hart et a/., 1968]. This paper proposes a general method of improving h. Instead of estimating h by eval uating a given state X with respect to the goal G. several new reference states are used to gain perspective [Nelson, 1988]. The relative position of X and G among the refer ence states will be used to estimate the distance between X and G. Assuming h is of a general nature and can be used to estimate the distance between any two states in the search space, then h can be used to estimate the distances from the reference states to both G and X. if the goal is used as a reference state r K , then ARk is just the traditional heuristic estimate h. These differ ence values AR i , where 1 < i < n and n is the number of reference states, will be used to give a better estimate of the actual distance from the X to G. The new esti mate will be referred to as H n and will …
منابع مشابه
CONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD
Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...
متن کاملDistributed NSGA-II for seismic retrofitting optimization with multi-core PC cluster
1. Abstract The distributed Genetic Algorithm (GA) for PC cluster with multi-core-CPUs is proposed as a time reducing method for determining the schemes of retrofitting existing buildings with Buckling restrained Brace (BRB). Nondominated Sorting Genetic Algorithm-II (NSGA-II), one of the derivative evolutionary algorithm in heuristic method, was applied since the optimization problem have a mu...
متن کاملSearching monotone multi-dimensional arrays
In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks’ search algorithm [2] for monotone 3-dimensional arrays to d-dimensions with d ≥ 4. Our new search algorithm is asymptotically optimal for d = 4.
متن کاملParameter Optimization of Multi-tank Model with Modified Dynamically Dimensioned Search Algorithm
Multi-tank model is proposed for heavy rainfall infiltration simulation since it can represent the nonlinear transport behavior and give predictions very quickly. On the other hand, because its parameter space is high dimensional, it is difficult to obtain optimal parameters using existing methods. A new optimization approach called modified dynamically dimensioned search (MDDS) is developed fo...
متن کاملWhen the Lowest Energy Does Not Induce Native Structures: Parallel Minimization of Multi-Energy Values by Hybridizing Searching Intelligences
BACKGROUND Protein structure prediction (PSP), which is usually modeled as a computational optimization problem, remains one of the biggest challenges in computational biology. PSP encounters two difficult obstacles: the inaccurate energy function problem and the searching problem. Even if the lowest energy has been luckily found by the searching procedure, the correct protein structures are no...
متن کامل